Lingüística racionalista: Descartes y Chomsky
نویسندگان
چکیده
منابع مشابه
The Descartes Rule of Sweeps and the Descartes Signature
The Descartes Rule of Signs, which establishes a bound on the number of positive roots of a polynomial with real coefficients, is extended to polynomials with complex coefficients. The extension is modified to bound the number of complex roots in a given direction on the complex plane, giving rise to the Descartes Signature of a polynomial. The search for the roots of a polynomial is sometimes ...
متن کاملArithmetic Multivariate Descartes' Rule Arithmetic Multivariate Descartes' Rule
Let L be any number field or p-adic field and consider F := (f1, . . . , fk) where fi∈L[x ±1 1 , . . . , x ±1 n ]\{0} for all i and there are exactlym distinct exponent vectors appearing in f1, . . . , fk. We prove that F has no more than 1+ ( σm(m− 1)2n2 logm )n geometrically isolated roots in Ln, where σ is an explicit and effectively computable constant depending only on L. This gives a sign...
متن کاملEmotion , Desire , and Numismatic Experience in Rene Descartes , Zhu Xi , and Wang Y Angming
Zhu Xi writes, "To extend understanding, one must first cultivate understanding. To cultivate understanding, there is only reduction of desires." I Wang Yangming writes, "When this heartmind is free of the obscurations of selfish desire, it is none other than the natural patterning. Nothing external need be added.,,2 Rene Descartes writes, "Because these passions cannot lead us to perform any a...
متن کاملWhat if Chomsky were right?
The outcome of scientific research depends on how a phenomenon is viewed and how the questions are phrased. This applies also to the nativist view of language acquisition. As a complement to MacWhinney’s discussion of nativism from the viewpoint of cognitive psychology, I would like to devote this commentary to the question of the title from the viewpoint of computational linguistics. Formally,...
متن کاملReflection in the Chomsky Hierarchy
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tópicos. Revista de Filosofía de Santa Fe
سال: 2018
ISSN: 1668-723X,1666-485X
DOI: 10.14409/topicos.v0i3.7306